COMMUNITY DETECTION ALGORITHM BASED ON LOCAL EXPANSION <em>K</em>-MEANS
نویسندگان
چکیده
منابع مشابه
Community Detection Algorithm Based on Local Expansion K-means
Community structure implies some features in various real-world networks, and these features can help us to analysis structural and functional properties in the complex system. It has been proved that the classic k-means algorithm can efficiently cluster nodes into communities. However, initial seeds decide the efficiency of the k-means, especially when detecting communities with different size...
متن کاملOverlapping Community Detection by Local Community Expansion
Community structure is the key aspect of complex network analysis and it has important practical significance. While in real networks, some nodes may belong to multiple communities, so overlapping community detection attracts more and more attention. But most of the existing overlapping community detection algorithms increase the time complexity in some extent. In order to detect overlapping co...
متن کاملHierarchical Community Detection Algorithm based on Local Similarity
Although community, one of the general characteristics of complex networks, has obvious hierarchical structure, in-depth research on its application in the current community detection algorithms is limited. In this paper we present a novel hierarchical community detection algorithm which starts from the node similarity calculation based on local adjacency in networks. Then we find the initial c...
متن کاملLocal Community Detection Based on Small Cliques
Community detection aims to find dense subgraphs in a network. We consider the problem of finding a community locally around a seed node both in unweighted and weighted networks. This is a faster alternative to algorithms that detect communities that cover the whole network when actually only a single community is required. Further, many overlapping community detection algorithms use local comm...
متن کاملPersistent K-Means: Stable Data Clustering Algorithm Based on K-Means Algorithm
Identifying clusters or clustering is an important aspect of data analysis. It is the task of grouping a set of objects in such a way those objects in the same group/cluster are more similar in some sense or another. It is a main task of exploratory data mining, and a common technique for statistical data analysis This paper proposed an improved version of K-Means algorithm, namely Persistent K...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Neural Network World
سال: 2016
ISSN: 1210-0552,2336-4335
DOI: 10.14311/nnw.2016.26.034